Highly connected monochromatic subgraphs of multicolored graphs

نویسندگان

  • Henry Liu
  • Robert Morris
  • Noah Prince
چکیده

We consider the following question of Bollobás: given an r-colouring of E(Kn), how large a k-connected subgraph can we find using at most s colours? We provide a partial solution to this problem when s = 1 (and n is not too small), showing that when r = 2 the answer is n−2k+2, when r = 3 the answer is ⌊n−k 2 ⌋+1 or ⌈n−k 2 ⌉ + 1, and when r − 1 is a prime power then the answer lies between n r−1 − 11(k − k)r and n−k+1 r−1 + r. The case s > 2 is considered in a subsequent paper [6], where we also discuss some of the more glaring open problems relating to this question.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Monochromatic and Heterochromatic Subgraphs in Edge-Colored Graphs - A Survey

Nowadays the term monochromatic and heterochromatic (or rainbow, multicolored) subgraphs of an edge colored graph appeared frequently in literature, and many results on this topic have been obtained. In this paper, we survey results on this subject. We classify the results into the following categories: vertex-partitions by monochromatic subgraphs, such as cycles, paths, trees; vertex partition...

متن کامل

Note on Highly Connected Monochromatic Subgraphs in 2-Colored Complete Graphs

In this note, we improve upon some recent results concerning the existence of large monochromatic, highly connected subgraphs in a 2-coloring of a complete graph. In particular, we show that if n ≥ 6.5(k − 1), then in any 2-coloring of the edges of Kn, there exists a monochromatic k-connected subgraph of order at least n−2(k−1). Our result improves upon several recent results by a variety of au...

متن کامل

Gallai colorings of non-complete graphs

Gallai-colorings of complete graphs – edge colorings such that no triangle is colored with three distinct colors – occur in various contexts such as the theory of partially ordered sets (in Gallai’s original paper), information theory and the theory of perfect graphs. We extend here Gallai-colorings to non-complete graphs and study the analogue of a basic result – any Gallai-colored complete gr...

متن کامل

On the complexity of edge-colored subgraph partitioning problems in network optimization

Network models allow one to deal with massive data sets using some standard concepts from graph theory. Understanding and investigating the structural properties of a certain data set is a crucial task in many practical applications of network optimization. Recently, labeled network optimization over colored graphs has been extensively studied. Given a (not necessarily properly) edge-colored gr...

متن کامل

TOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS

Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of total dominating set in $G$ and denoted by $gamma_t(G)$. The total domination polynomial of $G$ is the polynomial $D_t(G,x)=sum d_t(G,i)$, where $d_t(G,i)$ is the numbe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of Graph Theory

دوره 61  شماره 

صفحات  -

تاریخ انتشار 2009